10,273 research outputs found

    A quasi-random spanning tree model for the early river network

    Full text link
    We consider a model for the formation of a river network in which erosion process plays a role only at the initial stage. Once a global connectivity is achieved, no further evolution takes place. In spite of this, the network reproduces approximately most of the empirical statistical results of natural river network. It is observed that the resulting network is a spanning tree graph and therefore this process could be looked upon as a new algorithm for the generation of spanning tree graphs in which different configurations occur quasi-randomly. A new loop-less percolation model is also defined at an intermediate stage of evolution of the river network.Comment: 10 pages, RevTex, 4 postscript figures, accepted in PR

    Impact of wind farms capacity factor and participation in frequency support – reliability analysis

    Get PDF
    Expanded integration of wind energy implies technical confronts to maintain system reliability. Thus, comprehensive reliability models for wind turbines and related features are required. Composite and precise wind farms (WFs) reliability analysis includes wind turbine generator (WTG) detailed models besides wind speed (WS) probabilistic variations considering wake effects. This paper is considered as an extension to the proposed multi-state duration sampling model to asses WTG reliability integrated with a comprehensive representation for WF. The paper investigates the impacts of two WTG frequency support operation algorithms on capacity factors and first hierarchical level indices. LOEE is evaluated using a novel method to emphasis the chronological coordination between load and WS attitudes. System and load points’ reliability indices are estimated at moderate penetration levels of wind energy using a simplified technique. Results insure the feasibility of the composite WTG reliability model and provide reasonable indicators for WFs integration influence

    Heating and Turbulence Driving by Galaxy Motions in Galaxy Clusters

    Full text link
    Using three-dimensional hydrodynamic simulations, we investigate heating and turbulence driving in an intracluster medium (ICM) by orbital motions of galaxies in a galaxy cluster. We consider Ng member galaxies on isothermal and isotropic orbits through an ICM typical of rich clusters. An introduction of the galaxies immediately produces gravitational wakes, providing perturbations that can potentially grow via resonant interaction with the background gas. When Ng^{1/2}Mg_11 < 100, where Mg_11 is each galaxy mass in units of 10^{11} Msun, the perturbations are in the linear regime and the resonant excitation of gravity waves is efficient to generate kinetic energy in the ICM, resulting in the velocity dispersion sigma_v ~ 2.2 Ng^{1/2}Mg_11 km/s. When Ng^{1/2}Mg_11 > 100, on the other hand, nonlinear fluctuations of the background ICM destroy galaxy wakes and thus render resonant excitation weak or absent. In this case, the kinetic energy saturates at the level corresponding to sigma_v ~ 220 km/s. The angle-averaged velocity power spectra of turbulence driven in our models have slopes in the range of -3.7 to -4.3. With the nonlinear saturation of resonant excitation, none of the cooling models considered are able to halt cooling catastrophe, suggesting that the galaxy motions alone are unlikely to solve the cooling flow problem.Comment: 12 pages including 3 figures, To appear in ApJ

    Handbook of Anticancer Drug Development

    Get PDF

    Realizing live sequence charts in SystemVerilog.

    Get PDF
    The design of an embedded control system starts with an investigation of properties and behaviors of the process evolving within its environment, and an analysis of the requirement for its safety performance. In early stages, system requirements are often specified as scenarios of behavior using sequence charts for different use cases. This specification must be precise, intuitive and expressive enough to capture different aspects of embedded control systems. As a rather rich and useful extension to the classical message sequence charts, live sequence charts (LSC), which provide a rich collection of constructs for specifying both possible and mandatory behaviors, are very suitable for designing an embedded control system. However, it is not a trivial task to realize a high-level design model in executable program codes effectively and correctly. This paper tackles the challenging task by providing a mapping algorithm to automatically synthesize SystemVerilog programs from given LSC specifications
    corecore